منابع مشابه
Distributed constrained heuristic search
In this paper we present a model of decentralized problem solving, called Distributed Constrained Heuristic Search (DCHS) that provides both structure and focus in individual agent search spaces so as to optimize decisions in the global space. The model achieves this by integrating decentralized constraint satisfaction and heuristic search. It is a formalism suitable for describing a large set ...
متن کاملConstrained Heuristic Search
We propose a model of problem solving that provides both structure and focus to search. The model achieves this by combining constraint satisfaction wi th heuristic search. We introduce the concepts of topology and texture to characterize problem structure and areas to focus attention respectively. The resulting model reduces search complexity and provides a more principled explanation of the n...
متن کاملSelecting Task Decompositions for Constrained Heuristic Search
There is a large class of problems that can be represented by task decomposition trees which specify alternative sets of variables that must be given values. Any one of these alternatives can be represented as a constraint satisfaction problem. We describe a technique for selecting a task decomposition that results in a constraint problem that can be solved efficiently. This technique takes adv...
متن کاملHeuristic Search For Distributed Constraint Satisfaction Problems
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint satisfaction problem (CSP). Various distributed and parallel computing approaches have been used to solve these problems. Mainly, these approaches can be classiied as variable-based, domain-based, and function-based distributed problem solving strategies. In this paper, some heu...
متن کاملParallel Iterative A* Search: An Admissible Distributed Heuristic Search Algorithm
In this paper, a distributed heuristic search algorithm is presented. We show that the algorithm is admissible and give an informal analysis of its load balancing, scalability, and speedup. A flow-shop scheduling problem has been implemented on a BBN Butterfly Multicomputer using up to 80 processors to empirically test this algorithm. From our experiments, this algorithm is capable of achieving...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Systems, Man, and Cybernetics
سال: 1991
ISSN: 0018-9472
DOI: 10.1109/21.135688